/*  search.h
 * Copyright (C) 2010, Francisco Claude & Patrick Nicholson, all rights reserved.
 *
 * Francisco Claude & Patrick Nicholson <(fclaude|p3nichol)@cs.uwaterloo.ca>
 *
 *   This program is free software: you can redistribute it and/or modify
 *   it under the terms of the GNU General Public License as published by
 *   the Free Software Foundation, either version 3 of the License, or
 *   (at your option) any later version.
 *
 *   This program is distributed in the hope that it will be useful,
 *   but WITHOUT ANY WARRANTY; without even the implied warranty of
 *   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *   GNU General Public License for more details.
 *
 *   You should have received a copy of the GNU General Public License
 *   along with this program.  If not, see <http://www.gnu.org/licenses/>.
 *
 */

#include<iostream>
#include<fstream>
#include<sstream>
#include<algorithm>
#include<vector>
#include<map>
#include<list>
#include<queue>
#include<stack>
#include<cassert>
#include<cmath>

using namespace std;

#include "point.h"
#include "geometry.h"

#ifndef SEARCH_H
#define SEARCH_H

#define RIGHT 0
#define LEFT 1
#define CROSS 2
#define HIT 3

/** Searches and returns whether the the chain is to the left, right or crosses/hits the chain. Used for the adaptive search, it adds the points found to v. */
size_t searchChainCrossDes(vector<Point> & v, const Point * chain, const Point & p1, const Point & p2, const size_t len); 
/** Searches for points in the chain and adds the points found to v. */
size_t searchChainHitsDes(vector<Point> & v, const Point * chain, const Point & p1, const Point & p2, const size_t len); 

#endif

